Coordinating resources in Stackelberg Security Games

• We propose a new tighter compact MILP for Security Game that allow coordinate defender strategies. present complexity results this game. provide branch and cut algorithm to solve efficiently formulations. an exact approximate method sample the strategy space In work we formulate Stackelberg coordinates resources in border patrol problem. security domain, from different precincts have be paired conduct patrols due logistic constraints. Given structure, models enumerate pure strategies scale poorly. describe set of mixed using polynomial number variables but exponentially many constraints come matching polytope. then include description integer formulation compute Strong Equilibrium with scheme. Since optimal solution is probability distribution over exponential size, also introduce efficient sampling can used deploy every shift. Our computational evaluate efficiency scheme developed accuracy method.